package com.ds.tree;

public class BTree<T extends Comparable<? super T>> {
	
	private Node root;
	private int ht;
	
	public BTree(){
		root = new Node();
	}
	
	public Node insert(T t) {
		
		Node n = insert(t,root,ht);
		
		
		return null;
	}
	
	private Node insert(T t,Node node,int h) {
		
		if(h == 0) {
			
		}
		
		return null;
	}
	
	
	
	
}

class Node<T extends Comparable<? super T>>{
	
	private static final int M = 6;
	public int count;
	
	public Entity<T>[] children = new Entity[M];
	
	
	
}

class Entity<T extends Comparable<? super T>>{
	
	public T t;
	public Node next;
	
	
	public Entity(T t) {
		
		this(t, null);
		
	}
	
	public Entity(T t,Node node) {
		
		this.t = t;
		this.next = node;
		
	}
	
	
}
